Improved rosenbluth monte carlo scheme for cluster counting and lattice animal enumeration
نویسندگان
چکیده
We describe an algorithm for the Rosenbluth Monte Carlo enumeration of clusters and lattice animals. The method may also be used to calculate associated properties such as moments or perimeter multiplicities of the clusters. The scheme is an extension of the Rosenbluth method for growing polymer chains and is a simplification of a scheme reported earlier by one of the authors. The algorithm may be used to obtain a Monte Carlo estimate of the number of distinct lattice animals on any lattice topology. The method is validated against exact and Monte Carlo enumerations for clusters up to size 50, on a two dimensional square lattice and three dimensional simple cubic lattice. The method may be readily adapted to yield Boltzmann weighted averages over clusters.
منابع مشابه
Counting lattice animals in high dimensions
We present an implementation of Redelemeier’s algorithm for the enumeration of lattice animals in high-dimensional lattices. The implementation is lean and fast enough to allow us to extend the existing tables of animal counts, perimeter polynomials and series expansion coefficients in d-dimensional hypercubic lattices for 3 ≤ d ≤ 10. From the data we compute formulae for perimeter polynomials ...
متن کاملGPU implementation of the Rosenbluth generation method for static Monte Carlo simulations
We present parallel version of Rosenbluth Self-Avoiding Walk generation method implemented on Graphics Processing Units (GPUs) using CUDA libraries. The method scales almost linearly with the number of CUDA cores and the method efficiency has only hardware limitations. The method is introduced in two realizations: on a cubic lattice and in real space. We find a good agreement between serial and...
متن کاملNumerical simulation of a lattice polymer model at its integrable point
We revisit an integrable lattice model of polymer collapse using numerical simulations. This model was first studied by Blöte and Nienhuis (1989 J. Phys. A: Math. Gen. 22 1415) and it describes polymers with some attraction, providing thus a model for the polymer collapse transition. At a particular set of Boltzmann weights the model is integrable and the exponents ν = 12/23 ≈ 0.522 and γ = 53/...
متن کاملA New Monte Carlo Algorithm for Protein Folding
We demonstrate that the recently introduced pruned-enriched Rosenbluth method (PERM) leads to extremely efficient algorithms for the folding of simple model proteins. We test them on several models for lattice heteropolymers, and compare to published Monte Carlo studies. In all cases our algorithms are faster than previous ones, and in several cases we find new minimal energy states. In additio...
متن کاملAnnealing contour Monte Carlo algorithm for structure optimization in an off-lattice protein model.
We present a space annealing version for a contour Monte Carlo algorithm and show that it can be applied successfully to finding the ground states for an off-lattice protein model. The comparison shows that the algorithm has made a significant improvement over the pruned-enriched-Rosenbluth method and the Metropolis Monte Carlo method in finding the ground states for AB models. For all sequence...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
دوره 62 1 Pt B شماره
صفحات -
تاریخ انتشار 2000